The union-closed sets conjecture almost holds for almost all random bipartite graphs
نویسندگان
چکیده
Frankl’s union-closed sets conjecture states that in every finite unionclosed family of sets, not all empty, there is an element in the ground set contained in at least half of the sets. The conjecture has an equivalent formulation in terms of graphs: In every bipartite graph with least one edge, both colour classes contain a vertex belonging to at most half of the maximal stable sets. We prove that, for every fixed edge-probability, almost every random bipartite graph almost satisfies Frankl’s conjecture.
منابع مشابه
The graph formulation of the union-closed sets conjecture
In 1979 Frankl conjectured that in a finite non-trivial union-closed collection of sets there has to be an element that belongs to at least half the sets. We show that this is equivalent to the conjecture that in a finite non-trivial graph there are two adjacent vertices each belonging to at most half of the maximal stable sets. In this graph formulation other special cases become natural. The ...
متن کاملSparse graphs with no polynomial-sized anticomplete pairs
A graph is H-free if it has no induced subgraph isomorphic to H. An old conjecture of Conlon, Sudakov and the second author asserts that: • For every graph H, there exists ε > 0 such that in every H-free graph with n > 1 vertices there are two disjoint sets of vertices, of sizes at least εn and εn, complete or anticomplete to each other. This is equivalent to: • The ‘sparse linear conjecture’: ...
متن کاملMeyniel's conjecture holds for random graphs
In the game of cops and robber, the cops try to capture a robber moving on the vertices of the graph. The minimum number of cops required to win on a given graph G is called the cop number of G. The biggest open conjecture in this area is the one of Meyniel, which asserts that for some absolute constant C, the cop number of every connected graph G is at most C √ |V (G)|. In this paper, we show ...
متن کاملBipartite Kneser Graphs are Hamiltonian
The Kneser graph K(n, k) has as vertices all k-element subsets of [n] := {1, 2, . . . , n} and an edge between any two vertices (=sets) that are disjoint. The bipartite Kneser graph H(n, k) has as vertices all k-element and (n−k)-element subsets of [n] and an edge between any two vertices where one is a subset of the other. It has long been conjectured that all connected Kneser graphs and bipar...
متن کاملThe Laplacian energy of random graphs ∗
Gutman et al. introduced the concepts of energy E (G) and Laplacian energy EL(G) for a simple graph G, and furthermore, they proposed a conjecture that for every graph G, E (G) is not more than EL(G). Unfortunately, the conjecture turns out to be incorrect since Liu et al. and Stevanović et al. constructed counterexamples. However, So et al. verified the conjecture for bipartite graphs. In the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Eur. J. Comb.
دوره 59 شماره
صفحات -
تاریخ انتشار 2017